Euclidean Dynamics
نویسنده
چکیده
We study a general class of Euclidean algorithms which compute the greatest common divisor [gcd], and we perform probabilistic analyses of their main parameters. We view an algorithm as a dynamical system restricted to rational inputs, and combine tools imported from dynamics, such as transfer operators, with various tools of analytic combinatorics: generating functions, Dirichlet series, Tauberian theorems, Perron’s formula and quasi-powers theorems. Such dynamical analyses can be used to perform the average-case analysis of algorithms, but also (dynamical) analysis in distribution.
منابع مشابه
Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملOn the Quaternionic Curves in the Semi-Euclidean Space E_4_2
In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.
متن کاملMapping of Euclidean Resonance on Static Resonant Tunneling
Quantum tunneling through an almost classical potential barrier can be strongly enhanced by a nonstationary field so that the penetration through the barrier becomes not exponentially small. This constitutes an extremely unusual phenomenon of quantum physics called Euclidean resonance. A certain nonstationary barrier is proposed with a very low WKB tunneling rate. The quantum dynamics of this b...
متن کاملSolving the Direction Field for Discrete Agent Motion
Models for pedestrian dynamics are often based on microscopic approaches allowing for individual agent navigation. To reach a given destination, the agent has to consider environmental obstacles. We propose a direction field calculated on a regular grid with a Moore neighborhood, where obstacles are represented by occupied cells. Our developed algorithm exactly reproduces the shortest path with...
متن کاملParallel Transport Frame in 4 -dimensional Euclidean Space
In this work, we give parallel transport frame of a curve and we introduce the relations between the frame and Frenet frame of the curve in 4-dimensional Euclidean space. The relation which is well known in Euclidean 3-space is generalized for the rst time in 4-dimensional Euclidean space. Then we obtain the condition for spherical curves using the parallel transport frame of them. The conditi...
متن کامل